binary quadratic form

binary quadratic form
бинарная квадратичная форма

English-Russian dictionary of computer science and programming. 2013.

Игры ⚽ Нужен реферат?

Смотреть что такое "binary quadratic form" в других словарях:

  • Binary quadratic form — In mathematics, a binary quadratic form is a quadratic form in two variables. More concretely, it is a homogeneous polynomial of degree 2 in two variables where a, b, c are the coefficients. Properties of binary quadratic forms depend in an… …   Wikipedia

  • Quadratic form — In mathematics, a quadratic form is a homogeneous polynomial of degree two in a number of variables. For example, is a quadratic form in the variables x and y. Quadratic forms occupy a central place in various branches of mathematics, including… …   Wikipedia

  • Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… …   Wikipedia

  • Binäre quadratische Form — Eine binäre quadratische Form (in diesem Artikel oft kurz nur Form genannt), ist in der Mathematik eine quadratische Form in zwei Variablen x,y, also ein Polynom der Gestalt , wobei a,b,c die Koeffizienten der Form sind. Die Form f mit schreibt… …   Deutsch Wikipedia

  • Quadratische Form — Eine quadratische Form ist in der Mathematik eine Funktion, die sich in einigen Aspekten wie die quadratische Funktion verhält. Das bekannteste Beispiel ist das Quadrat des Betrages eines Vektors. Quadratische Formen tauchen in vielen Bereichen… …   Deutsch Wikipedia

  • Mock modular form — In mathematics, a mock modular form is the holomorphic part of a harmonic weak Maass form, and a mock theta function is essentially a mock modular form of weight 1/2. The first examples of mock theta functions were described by Srinivasa… …   Wikipedia

  • Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… …   Wikipedia

  • Binary Golay code — In mathematics and computer science, a binary Golay code is a type of error correcting code used in digital communications. The binary Golay code, along with the ternary Golay code, has a particularly deep and interesting connection to the theory …   Wikipedia

  • Emmy Noether — Amalie Emmy Noether Born 23 March 1882(1882 03 23) …   Wikipedia

  • Vorlesungen über Zahlentheorie — de. Vorlesungen über Zahlentheorie (German for Lectures on Number Theory ) is a textbook of number theory written by German mathematicians P.G.L. Dirichlet and Richard Dedekind, and published in 1863.Based on Dirichlet s number theory course at… …   Wikipedia

  • List of prime numbers — This is an incomplete list, which may never be able to satisfy particular standards for completeness. You can help by expanding it with reliably sourced entries. By Euclid s theorem, there are an infinite number of prime numbers. Subsets of the… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»